A 2-Approximation Algorithm for Stochastic Inventory Control Models with Lost Sales
نویسندگان
چکیده
منابع مشابه
A 2-Approximation Algorithm for Stochastic Inventory Control Models with Lost Sales
In this paper, we describe the first computationally efficient policies for stochastic inventory models with lost sales and replenishment lead times that admit worst-case performance guarantees. In particular, we introduce dual-balancing policies for lost-sales models that are conceptually similar to dual-balancing policies recently introduced for a broad class of inventory models in which dema...
متن کاملApproximation Algorithms for Stochastic Inventory Control Models
In this paper we address the long-standing problem of finding computationally efficient and provably good inventory control policies in supply chains with correlated and nonstationary (time-dependent) stochastic demands. This problem arises in many domains and has many practical applications such as dynamic forecast updates (for some applications see Erkip et al. 1990 and Lee et al. 1999). We c...
متن کاملInventory Control with Unobservable Lost Sales and Bayesian Updates
We study a finite-horizon lost-sales inventory model. The demand distribution is unknown and is dynamically updated based on the previous sales data in a Bayesian fashion. We derive a samplepath representation of the first order optimality condition, which characterizes the key tradeoff of the problem. The expression allows us to see why the computation of the optimal policy is difficult and wh...
متن کاملApproximation Algorithms for Capacitated Stochastic Inventory Control Models
We develop the first algorithmic approach to compute provably good ordering policies for a multi-period, capacitated, stochastic inventory system facing stochastic non-stationary and correlated demands that evolve over time. Our approach is computationally efficient and guaranteed to produce a policy with total expected cost no more than twice that of an optimal policy. As part of our computati...
متن کاملApproximation Algorithms for Capacitated Stochastic Lot-sizing Inventory Control Models
Introduction. We study a class of capacitated stochastic lot-sizing inventory control problems with stochastic, non-stationary and correlated demands that evolve over time. Economies of scale and capacity constraints exist in many practical scenarios. However, models with fixed ordering costs and capacity constraints are typically computationally intractable, and even the structure of the optim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2008
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.1070.0285